package euler.p001_050;

import euler.MainEuler;
import euler.helper.NaturalHelper;

public class Euler002 extends MainEuler {

    /*
        Each new term in the Fibonacci sequence is generated
        by adding the previous two terms. By starting with 1
        and 2, the first 10 terms will be:

        1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

        By considering the terms in the Fibonacci sequence whose
        values do not exceed four million, find the sum of
        the even-valued terms.
     */

    public String resolve(int limite) {
        int f = 0;
        int suma = 0;
        int i = 0;

        while (f < limite) {
            f = (int)NaturalHelper.fibonacci(i++);
            if (f < limite && f % 2 == 0) {
                suma+=f;
            }
        }

        return String.valueOf(suma);
    }

}
